Boolean constraint satisfaction problems for reaction networks
نویسندگان
چکیده
A. Seganti, A. De Martino and F. Ricci-Tersenghi 1 Dipartimento di Fisica, Sapienza Università di Roma, p.le A. Moro 2, 00185 Rome (Italy) 2 IPCF-CNR, UOS di Roma, Dip. Fisica, Sapienza Università di Roma (Italy) 3 Center for Life Nano Science@Sapienza, Istituto Italiano di Tecnologia, Viale Regina Elena 291, 00161 Roma (Italy) 4 INFN – sezione di Roma1, Dip. Fisica, Sapienza Università di Roma (Italy)
منابع مشابه
Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem.
We analyze the solutions, on single network instances, of a recently introduced class of constraint-satisfaction problems (CSPs), describing feasible steady states of chemical reaction networks. First, we show that the CSPs generalize the scheme known as network expansion, which is recovered in a specific limit. Next, a full statistical mechanics characterization (including the phase diagram an...
متن کاملCounting attractors in synchronously updated random Boolean networks
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. We here derive an expression for the number of attractors in the special case of one input per node. Approximating some other non-chaotic networks to be of this class, we apply the analytic results to them. For this a...
متن کاملSolving partial constraint satisfaction problems with tree decomposition
In this paper, we describe a computational study to solve hard partial constraint satisfaction problems (PCSPs) to optimality. The PCSP is a general class of problems that contains a diversity of problems, such as generalized subgraph problems, MAX-SAT, Boolean quadratic programs, and assignment problems like coloring and frequency planning. We present a dynamic programming algorithm that solve...
متن کاملModeling Planning Problems Using Constraint Satisfaction
Planning problems deal with finding a sequence of actions that transfer the initial state of the world into a desired state. Frequently such problems are solved by dedicated algorithms but there exist planners based on translating the planning problem into a different formalism such as constraint satisfaction or Boolean satisfiability and using a general solver for this formalism. This paper de...
متن کاملCoarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems
We study threshold properties of random constraint satisfaction problems under a probabilistic model due to Molloy [11]. We give a sufficient condition for the existence of a sharp threshold that leads (for boolean constraints) to a necessary and sufficient for the existence of a sharp threshold in the case where constraint templates are applied with equal probability, solving thus an open prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013